A Natural Deduction Approach to Dynamic Logic
نویسندگان
چکیده
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory, such as LEGO, Coq, etc. In fact, ND-style systems are the kind of systems which can take best advantage of the possibility of reasoning “under assumptions” offered by proof assistants generated by Logical Frameworks. In this paper we introduce and discuss sound and complete proof systems in Natural Deduction style for representing various “truth” consequence relations of Dynamic Logic. We discuss the design decisions which lead to adequate encodings of these logics in Coq. We derive in Dynamic Logic a set of rules representing a ND-style system for Hoare Logic.
منابع مشابه
A general approach to linguistic approximation and its application in frame of fuzzy logic deduction
This paper deals with one problem that needs to be addressed in the emerging field known under the name computing with perceptions. It is the problem of describing, approximately, a given fuzzy set in natural language. This problem has lately been referred to as the problem of retranslation. An approaches to dealing with the retranslation problem is discussed in the paper, that ...
متن کاملOn Natural Deduction in First-Ortder Fixpoint Logics
In the current paper we present a powerful technique of obtaining natural deduction proof systems for rst-order xpoint logics. The term xpoint logics refers collectively to a class of logics consisting of modal logics with modalities deenable at meta-level by xpoint equations on formulas. The class was found very interesting as it contains most logics of programs with e.g. dynamic logic, tempor...
متن کاملStochastic Interpretation of Game Logic
Game logic is a dynamic modal logic which models strategic two person games; it contains propositional dynamic logic (PDL) as a fragment. We propose an interpretation of game logic based on stochastic effectivity functions. A definition of these functions is proposed, and some algebraic properties of effectivity functions such as congruences are investigated. The relationship to stochastic rela...
متن کاملForward Slicing by Conjunctive Partial Deduction and Argument Filtering
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperative programming, this technique has been successfully applied to debugging, specialization, reuse, maintenance, etc. Due to its declarative nature, adapting the slicing notions and techniques to a logic programming set...
متن کاملPredicate logic with flexibly binding operators and natural language semantics
A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including ‘donkey sentences’ and crosssentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995